A SAT Approach to Branchwidth
نویسندگان
چکیده
Branch decomposition is a prominent method for structurally decomposing a graph, hypergraph or CNF formula. The width of a branch decomposition provides a measure of how well the object is decomposed. For many applications it is crucial to compute a branch decomposition whose width is as small as possible. We propose a SAT approach to finding branch decompositions of small width. The core of our approach is an efficient SAT encoding which determines with a single SAT-call whether a given hypergraph admits a branch decomposition of certain width. For our encoding we developed a novel partition-based characterization of branch decomposition. The encoding size imposes a limit on the size of the given hypergraph. In order to break through this barrier and to scale the SAT approach to larger instances, we developed a new heuristic approach where the SAT encoding is used to locally improve a given candidate decomposition until a fixed-point is reached. This new method scales now to instances with several thousands of ver-
منابع مشابه
SAT-Encodings for Special Treewidth and Pathwidth
Decomposition width parameters such as treewidth provide a measurement on the complexity of a graph. Finding a decomposition of smallest width is itself NP-hard but lends itself to a SAT-based solution. Previous work on treewidth, branchwidth and clique-width indicates that identifying a suitable characterization of the considered decomposition method is key for a practically feasible SAT-encod...
متن کاملPlanar Branch Decompositions II: The Cycle Method
T is the second of two papers dealing with the relationship of branchwidth and planar graphs. Branchwidth and branch decompositions, introduced by Robertson and Seymour, have been shown to be beneficial for both proving theoretical results on graphs and solving NP-hard problems modeled on graphs. The first practical implementation of an algorithm of Seymour and Thomas for computing optimal bran...
متن کاملBranchwidth of graphic matroids
Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is equal to the branchwidth of its cycle matroid. Our proof is based on branch-decompositions
متن کاملBranchwidth of chordal graphs
This paper revisits the ’branchwidth territories’ of Kloks, Kratochv́ıl and Müller [12] to provide a simpler proof and a faster algorithm for computing branchwidth of an interval graph. We also generalize the algorithm to the class of chordal graphs, albeit at the expense of exponential running time. Compliance with the ternary constraint of the branchwidth definition is facilitated by a simple ...
متن کاملGraphs with Branchwidth at Most Three
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set of graphs with branchwidth at mo...
متن کامل